|
課程名稱 |
演算法
Algorithms |
|
開課學期 |
112-1 |
|
授課對象 |
電機工程學系 |
|
授課教師 |
劉智弘 |
|
課號 |
EE4033 |
|
課程識別碼 |
901E39000 |
|
班次 |
03 |
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
必修 |
|
上課時間 |
星期三7,8,9(14:20~17:20) |
|
上課地點 |
電二145 |
|
備註 |
本課程以英語授課。外系學生加選請於加退選時詢問授課老師。
限本系所學生(含輔系、雙修生)
總人數上限：80人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
This course provides an introduction to the design and analysis of computer algorithms. We will cover topics including concepts of algorithm complexity, and various algorithms such as divide-and-conquer, dynamic programming, sorting, and greedy algorithms.
For those who would like to add this course (加簽), please fill in this Google form and follow the instruction: https://forms.gle/BWtNsgBe7De2vGND8 |
|
課程目標 |
Upon completion of this course, students will be able to design, analyze, apply, and implement algorithms in common engineering design situations. |
|
課程要求 |
A strong understanding of programming and data structure, as well as a solid background in discrete mathematics, including probability, are necessary prerequisites to this course. Students must be able to program in C＋＋ or C on the Linux platform.
|
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 3rd Ed.,
McGraw Hill/MIT Press, 2009 |
|
參考書目 |
|
|
評量方式
(僅供參考) |
|
|
週次 |
日期 |
單元主題 |
|
第1週 |
9/5 |
- Syllabus
- Foundations
- Divide and Conquer (until MergeSort) |
|